Byzantine-Resilient Secure Federated Learning on Low-Bandwidth Networks
نویسندگان
چکیده
Privacy-preserving and Byzantine-resilient machine learning has been an important research issue, many centralized methods have developed. However, it is difficult for these to achieve fast high accuracy simultaneously. In contrast, federated based on local model masking like Byzantine-Resilient Secure Aggregation (BREA), a promising approach simultaneously them. Despite the advantage of light computation randomizing models users privacy preservation, verification shares generated from in BREA, which mitigates Byzantine attacks, still incurs large complexity communication. The paper designs share method BREA offload some parts process semi-honest server, avoids broadcasting large-size commitments shares. addition, mitigate increase time due computations offloaded our makes algorithm running server efficient executes user parallel. experiments, provides speedup up $15\times $ low-bandwidth networks mobile networks. Our also preserves BREA’s resilience against attacks.
منابع مشابه
An On-Demand Byzantine-Resilient Secure Routing Protocol for Wireless Adhoc Networks
Security has become a primary concern in order to provide protected communication between mobile nodes in a hostile environment. We refer to any arbitrary action by authenticated nodes resulting in disruption of the routing service such as drop packets, modify packets and miss-route packets as Byzantine behavior, and to such an adversary as a Byzantine adversary. Nodes may exhibit Byzantine beh...
متن کاملByRDiE: Byzantine-resilient distributed coordinate descent for decentralized learning
Distributed machine learning algorithms enable processing of datasets that are distributed over a network without gathering the data at a centralized location. While efficient distributed algorithms have been developed under the assumption of faultless networks, failures that can render these algorithms nonfunctional indeed happen in the real world. This paper focuses on the problem of Byzantin...
متن کاملOptimal Byzantine Resilient Convergence in Asynchronous Robots Networks
We propose the first deterministic algorithm that tolerates up to f byzantine faults in 3f + 1-sized networks and performs in the asynchronous CORDA model. Our solution matches the previously established lower bound for the semi-synchronous ATOM model on the number of tolerated Byzantine robots. Our algorithm works under bounded scheduling assumptions for oblivious robots moving in a uni-dimens...
متن کاملPractical Secure Aggregation for Federated Learning on User-Held Data
Secure Aggregation protocols allow a collection of mutually distrust parties, each holding a private value, to collaboratively compute the sum of those values without revealing the values themselves. We consider training a deep neural network in the Federated Learning model, using distributed stochastic gradient descent across user-held training data on mobile devices, wherein Secure Aggregatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2023
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2023.3277858